Relay node communication interface transmitting update packet to higher node by executing chain indivisibility instructions upon receiving data change notification from lower node

ABSTRACT

A first storing unit stores therein a chain indivisibility instruction. A detecting unit detects a change of first data that is distributed in a node computer. A first designating unit designates, when the detecting unit detects the change in the first data, an indivisibility instruction corresponding to the first data from which the change is detected, by referring to the first storing unit. A first executing unit executes the indivisibility instruction designated by the first designating unit.

CROSS REFERENCE TO RELATED APPLICATIONS

This application claims the benefit under 35 U.S.C. Section 119 ofJapanese Patent Application No. 2006-145924, filed May 25, 2006, whichis hereby incorporated by reference in it's entirety into thisapplication.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention generally relates to a technology for transmittinginformation on a change of shared data to a higher node computer whilesuppressing an overhead in a parallel computer system having amulti-stage multi-branch tree structure.

2. Description of the Related Art

Conventionally, there has been known a technique for transmitting andreceiving data among a plurality of computers using internodecommunication by connecting the computers to one another, and forsharing the data among the computers. It is important particularly for aparallel computer system, in which a plurality of computers is connectedto one another to act as if the node computers operate as one computerto keep consistency of the shared data.

However, it is difficult to keep the consistency of the shared datathrough the communication held in the parallel computer system becauseof frequent communications and heavy overhead of a processor using acontext switch for the communications.

To solve the disadvantages, the following parallel computer system isdisclosed in, for example, Japanese Patent Application Laid-Open No.H7-152640. The parallel computer system includes a shared-data managingunit. In the parallel computer system, a computer that changes shareddata present in a common memory notifies the shared-data managing unitof a change in the shared data. The shared managing unit manages thechange in the shared data based on the notification. According to thetechnique disclosed in the Japanese Patent Application Laid-Open No.H7-152640, it is possible to keep consistency of the shared data in theparallel computer system by causing computers other than the computerthat changes the shared data to refer to the change in the shared datamanaged by the shared-data managing unit. Furthermore, overhead can besuppressed in the parallel computer system and the consistency of theshared data can be kept by using the above mechanism.

The conventional technique disclosed in the Japanese Patent ApplicationLaid-Open No. H7-152640 has, however, the following disadvantages.Differently from an instance in which shared data is stored in theshared memory, if data dependency relationship is held among a pluralityof computers in the parallel computer system, a higher node computercannot determine whether data input from a lower node computer has hadchange.

Specifically, the parallel computer system has a multi-branch treestructure with one node configuration/topology. Due to this, informationon the change in shared data made by the lower node computer can bepromptly transmitted to all the other node computers. However, if theparallel computer system has a multi-branch tree structure withmultiple-node configuration/topology and data held in each node computerdepends on data held in the lower node computers, it is actually,disadvantageously difficult to transmit information on the change in theshared data up to the highest node computer because of the restrictionsimposed by communication overhead.

SUMMARY OF THE INVENTION

It is an object of the present invention to at least partially solve theproblems in the conventional technology.

A communication interface device of a node computer in a parallelcomputer system, according to one aspect of the present invention,includes a first storing unit that stores therein a chain indivisibilityinstruction; a detecting unit that detects a change of first data thatis distributed in the node computer; a first designating unit thatdesignates, when the detecting unit detects the change in the firstdata, an indivisibility instruction corresponding to the first data fromwhich the change is detected, by referring to the first storing unit;and a first executing unit that executes the indivisibility instructiondesignated by the first designating unit.

A communication method for a node computer in a parallel computersystem, according to another aspect of the present invention, includesfirst storing including first storing; detecting a change of first datathat is distributed in the node computer; first designating includingdesignating, when the change in the first data is detected, anindivisibility instruction corresponding to the first data from whichthe change is detected, by referring to stored chain indivisibilityinstruction; and first executing including executing the indivisibilityinstruction designated at the first designating.

The above and other objects, features, advantages and technical andindustrial significance of this invention will be better understood byreading the following detailed description of presently preferredembodiments of the invention, when considered in connection with theaccompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic for explaining disadvantages with a dependent-datamatch processing performed among node computers in a conventionalparallel computer system;

FIG. 2 is a schematic for explaining features of a dependent-data matchprocessing performed among node computers in a parallel computer systemaccording to a first embodiment of the present invention;

FIG. 3 is a functional block diagram of a configuration of a lower nodecomputer in the parallel computer system shown in FIG. 2;

FIG. 4 is a schematic for explaining contents of a storing unit includedin each of the node computers shown in FIG. 2;

FIG. 5 is a functional block diagram of a configuration of a relay nodecomputer in the parallel computer system shown in FIG. 2;

FIG. 6 is a functional block diagram of a configuration of a higher nodecomputer in the parallel computer system shown in FIG. 2;

FIG. 7 is a first sequence chart of a dependent-data match processingperformed among the node computers in the parallel computer system shownin FIG. 2;

FIG. 8 is a second sequence chart of the dependent-data match processingperformed among the node computers in the parallel computer system shownin FIG. 2;

FIG. 9 is a schematic for explaining features of a dependent-data matchprocessing performed among node computers in a parallel computer systemaccording to a second embodiment of the present invention;

FIG. 10 is a functional block diagram of a configuration of a lower nodecomputer in the parallel computer system shown in FIG. 9;

FIG. 11 is a functional block diagram of a configuration of a relay nodecomputer in the parallel computer system shown in FIG. 9;

FIG. 12 is a functional block diagram of a configuration of a highernode computer in the parallel computer system shown in FIG. 9;

FIG. 13 is a first sequence chart of a dependent-data update/referringprocessing performed among the node computers in the parallel computersystem shown in FIG. 9; and

FIG. 14 is a second sequence chart of the dependent-dataupdate/referring processing performed among the node computers in theparallel computer system shown in FIG. 9.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Exemplary embodiments of the present invention will be explained indetail below with reference to the accompanying drawings. According tothe embodiments, instances of applying the present invention to aprocessing related to consistency of a plurality of dependent data(hereinafter, “dependent-data match processing”) in a parallel computersystem will be explained. The parallel computer system is configured sothat a plurality of node computers is connected to one another toperform parallel applications, and the dependent data is arranged to bedistributed to the respective node computers. Among the data, the dataarranged in a higher node computer depends on that arranged in a lowernode computer. Examples of the parallel computer system according to theembodiments of the present invention widely include various computerssuch as a cluster computer and a grid computer. Furthermore, acommunication interface device according to the embodiments of thepresent invention is based on remote direct memory access (RDMA), whichis a scheme for direct access from a remote computer to a memory,represented by InfiniBand and Myrinet (registered trademarks) asinterface standards for the node computers in the parallel computersystem.

The dependent-data match processing according to a first embodiment willbe explained. A plurality of data is arranged to be distributed to eachof the node computers in a parallel computer system, and has adependency relationship with one another in a multi-tree structure. Inthe dependent-data match processing according to the first embodiment, anotification indicating the update of data arranged in a lower nodecomputer is transmitted to a higher node computer to recalculate datathat is arranged in the higher node computer and that depends on thedata arranged in the lower node computer whenever data is updated in thelower node computer.

Prior to the dependent-data match processing according to the firstembodiment, disadvantages with the dependent-data match processingperformed among node computers in a conventional parallel computersystem will be explained with reference to FIG. 1. As shown in FIG. 1,data arranged in a highest node computer depends on data arranged inrelay node computers arranged adjacent to the highest node computerunder the tree-structure dependency relationship. The data arranged ineach of the relay node computers depends on data arranged in lower nodecomputers arranged adjacent to each of the relay node computers underthe tree-structure dependency relationship. Namely, the data arranged inthe higher node computer depends on the data arranged in the lower nodecomputers.

It is assumed that the data is updated in one of the lowest nodecomputers as shown in (1) of FIG. 1. The data arranged in the relay nodecomputer adjacent to the lowest node computer depends on the dataarranged in the lowest node computer. The lowest node computer transmitsa notification indicating invalidation of the data accompanying the dataupdate in the lowest node computer to the higher relay node computeradjacent to the lowest node computer using an internode communication asshown in (2) of FIG. 2. The relay node computer recalculates and updatesthe data arranged therein based on the data updated in the lowest nodecomputer.

Furthermore, the data arranged in the highest node computer adjacent tothe relay node computer depends on the data arranged in the relay nodecomputer. The relay node computer transmits a notification indicatinginvalidation of the data accompanying the data update in the relay nodecomputer to the highest node computer using the internode communicationas shown in (2) of FIG. 1. The highest node computer, therefore, detectsthe data update shown in (1) of FIG. 1 and the invalidation of the datashown in (2) of FIG. 1 at “high cost” as shown in (3) of FIG. 1.

The meaning of the “high cost” is as follows. The notificationindicating the invalidation of dependent data arranged to be distributedin the parallel computer system is transmitted from the lower nodecomputer to the higher node computer using the internode communication.The internode communication has, however, the following drawbacks. Aninterrupt occurs in a processor of each of the node computers whenever apacket is transmitted or received, and a standby processing forreceiving the packet provokes a disturbance in a context switch of theprocessor. As a result, a communication rate at which the node computerscommunicate with one another is decelerated.

If the node computers in the parallel computer system hold communicationusing the internode communication while the node computers have, inparticular, the dependency relationship of data in the multi-treestructure/topology, overhead is generated. Specifically, the overhead isgenerated when the lowest node computer transmits the notificationindicating the invalidation of the data accompanying the data update tothe highest node computer via a plurality of relay node computers usingthe internode communication. The overhead causes deceleration of thecommunication rate at which the node computers communicate with oneanother and eventually deteriorates improvement of performances of theparallel computer system. This situation is expressed as the “highcost”.

The present invention has been achieved to solve the conventionaldisadvantages. According to the first embodiment, it is possible toefficiently transmit the notification indicating the invalidation of thedata accompanying the update of the data arranged to be distributed inthe respective node computers that have the data dependency relationshipin the multiple-tree structure/topology in the parallel computer systemwithout an interrupt in the processor of each of the node computers anda disturbance in the context switch of the processor.

The dependent-data match processing performed among the node computersin the parallel computer system according to the first embodiment willbe explained with reference to FIG. 2. In FIG. 2, a lower node computer100 serves as a lowest node computer, a relay node computer 200 servesas a relay node computer, and a higher node computer 300 serves as ahighest node computer. The respective node computers in the parallelcomputer system shown in FIG. 2 have the data dependency relationshipwith one another in the multi-tree structure.

In FIG. 2, similarly to FIG. 1, data arranged in the higher nodecomputer 300 depends on data arranged in the relay node computer 200adjacent to the higher node computer 300 under the dependencyrelationship in the multi-tree structure. The data arranged in the relaynode computer 200 depends on data arranged in the lower node computer100 adjacent to the relay node computer 200 under the dependencyrelationship in the multi-tree structure. Namely, the data arranged inthe higher node computer 300 depends on the data arranged in the relaynode computer 200 and the lower node computer 100 that are lower thanthe higher node computer 300.

It is assumed that the data is updated in the lower node computer 100 ata lowest level as shown in (1) of FIG. 2. The data arranged in the relaynode computer 200 adjacent to the lower node computer 100 depends on thedata arranged in the lower node computer 100. The lower node computer100 transmits a notification indicating invalidation of the dataaccompanying the data update in the lower node computer 100 to the relaynode computer 200 adjacent to the lower node computer 100 using a chaincommunication held by a communication interface (I/F) included in eachof the node computers as shown in (2) of FIG. 2. The relay node computer200 recalculates and updates the data arranged therein based on the dataupdated in the lower node computer 100.

Furthermore, the data arranged in the higher node computer 300 adjacentto the relay node computer 200 depends on the data arranged in the relaynode computer 200. If the data is updated and thereby invalidated in therelay node computer 200, the relay node computer 200 transmits anotification indicating invalidation of the data accompanying the dataupdate in the relay node computer 200 to the higher node computer 300using the chain communication held by the communication I/F included ineach of the node computers as shown in (2) of FIG. 2. The higher nodecomputer 300 located at the highest level, therefore, detects the dataupdate shown in (1) of FIG. 2 and the invalidation of the data shown in(2) of FIG. 2 at “low cost” and manages the update using a flag as shownin (3) of FIG. 2.

The meaning of the “low cost” is as follows. According to the firstembodiment, the notification indicating the update of the dependent datais transmitted from the lower node computer to the higher node computerarranged to be distributed in the parallel computer system using thechain communication held by the communication I/F included in each ofthe node computers.

If the node computers in the parallel computer system hold communicationusing the chain communication held by the communication I/F included ineach node computer, even when the node computers have the dependencyrelationship of data in the multi-tree structure/topology, overhead canbe suppressed. As explained, the overhead is generated when the lowestnode computer transmits the notification indicating the invalidation ofthe data accompanying the data update to the highest node computer via aplurality of relay node computers.

If the internode communication is used to transmit the notificationindicating the invalidation of the data accompanying the data update,then an interrupt occurs in a processor of each of the node computerswhenever a packet is transmitted or received and the standby processingfor receiving the packet provokes a disturbance in a context switch ofthe processor. This causes deceleration of a communication rate at whichthe node computers communicate with one another. According to the firstembodiment, the internode communication is not used, so that thesedisadvantages do not occur. It is, therefore, possible to preventdeterioration in performances of the parallel computer system and makemost use of the performances of the parallel computer system withoutdecelerating the communication rate at which the node computers holdcommunication with one another. This situation is expressed as the “lowcost”.

A configuration of the lower node computer 100 in the parallel computersystem shown in FIG. 2 will be explained with reference to FIG. 3. Thelower node computer 100, the relay node computer 200, and the highernode computer 300 include identical functional blocks. Functional blocksother than those characteristic of the lower node computer 100 shown inFIG. 3 will not be explained herein. As shown in FIG. 3, the lower nodecomputer 100 includes a processor 101 that controls entirety of thelower node computer 100, a storing unit 102, and a communication I/F 103that is a network interface card.

The storing unit 102 includes a data storing unit 102 a such as a memorythat is a storage area for storing data, and a chain send-work-request(SWR) storing unit 102 b that stores therein chain SWRs. The SWR meansan instruction to transmit a packet to an outside. A packet istransmitted to the outside based in response to the SWR. The chain SWRsare a group of the SWRs associated with one another in order. If thechain SWRs are output, all the associated SWRs are output in order. Apacket in response to each of the output SWRs is transmitted to theoutside.

According to the first embodiment, the packet transmitted or receivedincludes data on which a corresponding atomic operation is executed andpointer information indicating addresses where the chain SWRs to beexecuted are stored in the chain-SWR storing unit 102 b. The datastoring unit 102 a stores therein not only the data on which thecorresponding atomic operation is performed but also the pointerinformation indicating a top address of the addresses where the chainSWRs to be executed are stored in the chain-SWR storing unit 102 b.

The communication I/F 103 includes a data update detector 103 a and achain executer 103 b. The data update detector 103 a detects update ofupdate-detection target data stored in the data storing unit 102 a.

If the chain executer 103 b is notified of the detection of the dataupdate by the data update detector 103 a, the chain executer 103 b readsthe pointer information indicating the top address of the addresseswhere the chain SWRs to be executed are stored from the data storingunit 102 a. Furthermore, the chain executer 103 b reads a first SWRstored at an address indicated by the pointer information and executesan atomic operation. Next, the chain executer 103 b reads a second SWRto be transmitted subsequently to the first SWR stored in the chain-SWRstoring unit 102 b from the pointer information indicating an addresswhere the second SWR is stored, and executes a corresponding atomicoperation. Chain processings are repeated as long as the pointerinformation indicating an address where a SWR to be transmitted next isstored, is stored. As a consequence, if one packet is received from theoutside, then the chain SWRs are sequentially read by functions of thecommunication I/F 103, the corresponding atomic operations are executed,and the corresponding packets are transmitted.

In this way, the lower node computer 100 transmits the packets to therelay node computer 200 according to the update of the update-detectiontarget data stored in the data storing unit 102 a.

Contents of the storing unit 102 included in each of the node computerswill be explained with reference to FIG. 4. In FIG. 4, the contents ofthe storing unit 102 included in the lower node computer 100 are shown.

As shown in FIG. 4, the storing unit 102 stores therein a pointerindicating a top storage area for the chain SWRs at an address 1.Specifically, the information indicated by this pointer is an addressX₁. The storing unit 102 stores therein SWR-related data at an address2. Storage areas indicated by the addresses 1 and 2 are present in thedata storing unit 102 a.

At the address X₁, the pointer of the data storage area (i.e., theaddress 2), the SWR1 in the chain SWRs, and the pointer of the storagearea (i.e., an address X₂) in which the SWR2 subsequent to the SWR1 isstored are stored. Likewise, at the address X₂, the pointer of the datastorage area (i.e., the address 2), the SWR2 in the chain SWRs, and thepointer of the storage area in which a SWR3 subsequent to the SWR2 isstored are stored. In this manner, all the chain SWRs are stored to beaccompanied by pointers indicating the storage areas of the respectiveSWRs which are to be read next and on which corresponding atomicoperations are executed. It is to be noted that storage areas indicatedby the addresses X₁, addresses X₂, . . . are present in the chain-SWRstoring unit 102 b.

The data update detector 103 a designates an address of a memory areafor which an operation is designated using an actual address. The chainexecuter 103 b transmits a corresponding packet to the other nodecomputer based on an instruction to transmit the packet to the othernode computer.

A configuration of the relay node computer 200 in the parallel computersystem shown in FIG. 2 will be explained with reference to FIG. 5.Functional blocks other than those characteristic of the relay nodecomputer 200 shown in FIG. 5 will not be explained herein. As shown inFIG. 5, the relay node computer 200 includes a processor 201 thatcontrols entirety of the relay node computer 200 and that performsprocessings and calculations, a storing unit 202, and a communicationI/F 203 that is a network interface card.

The storing unit 202 includes a data storing unit 202 a such as a memorythat is a storage area for storing data, and a chain-SWR storing unit202 b that stores therein chain SWRs. The data storing unit 202 a andthe chain-SWR storing unit 202 b function similarly to the data storingunit 102 a and the chain-SWR storing unit 102 b.

The communication I/F 203 includes a packet-reception-time executer 203a and a chain executer 203 b. Upon reception of a packet, thepacket-reception-time executer 203 a executes a memory operationcorresponding to the received packet in the data storing unit 202 a, andinstructs the chain executer 203 b to execute chain atomic operations.

If the chain executer 203 b is instructed to execute chain atomicoperations by the packet-reception-time executer 203 a, the chainexecuter 203 b reads the pointer information indicating the top addressof the addresses where the chain SWRs to be executed are stored, fromthe data storing unit 202 a. Furthermore, the chain executer 203 b readsthe first SWR stored at the address indicated by the pointer andexecutes a corresponding atomic operation. Next, the chain executer 203b reads the second SWR from the pointer indicating the address where thesecond SWR to be executed next to the first SWR is stored, is stored toaccompany the first SWR stored in the chain-SWR storing unit 202 b, andexecutes a corresponding atomic operation. The chain processings arerepeated as long as the pointer information indicating an address wherean SWR to be executed next is stored, is stored. As a consequence, ifone packet is received from the outside, then the chain SWRs issequentially read by functions of the communication I/F 203, and thecorresponding atomic operations are executed.

Specifically, in response to reception of the packet from the lower nodecomputer 100, the chain SWRs are output, and the packets correspondingto each of the SWRs are transmitted to the outside of the relay nodecomputer 200 such as the higher node computer 300.

It is to be noted that the packet-reception-time executer 203 a canreceive not only packets from the other node computer, but also thosefrom the relay node computer 200 including the packet-reception-timeexecuter 203 a. This is based on the fact that the packet-reception-timeexecuter 203 a can transmit packets to the relay node computer 200.

Furthermore, the address of the memory area for which the operation isdesignated by the received packet is a virtual address. Thecommunication I/F 203, therefore, includes a function of converting thevirtual address into an actual address. The packet-reception-timeexecuter 203 a outputs an instruction to cause the chain executer 203 bto execute chain processings related to the data reception, to the chainexecuter 203 b. The chain executer 203 b transmits a correspondingpacket to the other node computer in response to the instruction totransmit the packet to the other node computer.

A configuration of the higher node computer 300 in the parallel computersystem shown in FIG. 2 will be explained with reference to FIG. 6.Functional blocks other than those characteristic of the higher nodecomputer 300 shown in FIG. 6 will not be explained herein.

As shown in FIG. 6, the higher node computer 300 includes a processor301 such as a CPU, a storing unit 302 such as a memory, and acommunication I/F 303 that is a network interface card. The storing unit302 includes a data-update-flag storing unit 302 a that stores thereinthe notification indicating the update of data in the lower nodecomputer 100 or the relay node computer 200 using a data-update flag,and a data storing unit 302 b that is an area in which data including areceived packet is written. The communication I/F 303 includes aninterrupt generator 303 a and a packet-reception-time executer 303 b.

The interrupt generator 303 a generates an interrupt or an event in theprocessor 301 based on an interrupt-processing generation instructionfrom the packet-reception-time executer 303 b. Upon reception of apacket from the other node computer, the packet-reception-time executer303 b executes an atomic operation corresponding to the received packetand directly performs a memory operation in the data storing unit 202 a.Specifically, the packet-reception-time executer 303 b turns on thedata-update flag in the data-update-flag storing unit 302 a.

It is to be noted that the packet-reception-time executer 303 b canreceive not only packets from the other node computer, but also thosefrom the higher node computer 300 including the packet-reception-timeexecuter 303 b. This is based on the fact that the packet-reception-timeexecuter 303 b can transmit packets to the higher node computer 300.

Furthermore, the address of the memory area for which the operation isdesignated by the received packet is a virtual address. Thecommunication I/F 303, therefore, includes a function of converting thevirtual address into an actual address. The packet-reception-timeexecuter 303 b outputs an instruction to cause the interrupt generator303 a to generate an interrupt processing related to the data reception,to the interrupt generator 303 a.

In this manner, in the lower node computer 100, the relay node computer200, and the higher node computer 300 according to the first embodiment,a transmission processing for transmitting the notification indicatingthe update of data under the dependency relationship in the lower nodecomputer 100 to the higher node computer 300 via the relay node computer200 is performed only using the communication I/Fs 103, 203, and 303.Conventionally, the transmission processing is performed by theprocessors 101, 201, and 301. Therefore, according to the firstembodiment, it is possible to suppress a disturbance in the contextswitch of each processor caused by the interrupt generated whenever apacket is received and by a synchronous processing. Namely, according tothe first embodiment, the generation of the interrupt whenever a packetrelated to the transmission processing is received can be suppressed,and the transmission processing is handed over from software controlperformed by each processor to a hardware processing performed by eachcommunication I/F. It is, therefore, possible to suppress thedisturbance in the context switch of each processor, increase thecommunication rate at which the node computers communicate with oneanother in the parallel computer system, and improve processingcapabilities of the parallel computer system.

According to the first embodiment, a data cache mechanism for chainingconsistency of the data under the dependency relationship among the nodecomputers of the parallel computer system can be realized. Namely, thenode computers have the data dependency relationship, mutually hold datacaches, and can automatically recognize the consistency of the cacheddata using the respective communication I/Fs.

If an attention is paid to the characteristic features of distributedapplications in the parallel computer system, it is conventionallynecessary to perform the same recalculation despite no change in input.If the data dependency relationship is held in the multi-tree structure,it is unnecessary to perform the same recalculation as long as inputdata is not updated. Nevertheless, it is conventionally difficult torecognize whether the input data is updated at a final data output sideso as to cancel the same recalculation. According to the firstembodiment, it is advantageously easy to recognize whether the inputdata is updated at the final data output side.

If the notification indicating the update of the input data istransmitted from the lower node computer 100 eventually to the highernode computer 300, the higher node computer 300 pays attention to use ofthe data dependent on the input data. Alternatively, updated new datacan be transmitted to the higher node computer 300 together with thenotification indicating the update of the input data, and the highernode computer 300 can recalculate the data based on the update of theinput data.

The dependent-data match processing performed among the node computersin the parallel computer system shown in FIG. 2 will be explained withreference to FIGS. 7 and 8. As shown in FIGS. 7 and 8, in the lower nodecomputer 100, the data update detector 103 a detects data update (stepS101). The data update detector 103 a notifies the chain executer 103 bof the detection of the data update (step S102). In response to thenotification, the chain executer 103 b reads the chain SWRs related tothe data update notification from the storing unit 102 (step S103), andtransmits corresponding chain packets related to the data updatenotification to the relay node computer 200 (step S104).

In the relay node computer 200, upon reception of the correspondingchain packets related to the data update notification, thepacket-reception-time executer 203 a outputs a data update notificationto the chain executer 203 b (step S105). The chain executer 203 b, whichhas detected the data update notification, reads the chain SWRs relatedto the data update notification from the storing unit 202 (step S106),and transmits corresponding chain packets related to the data updatenotification to the higher node computer 300 (step S107).

In the higher node computer 300, upon reception of the correspondingchain packets related to the data update notification, thepacket-reception-time executer 203 a outputs a data update notificationto the data-update-flag storing unit 302 a to store the data updatenotification in the data-update-flag storing unit 302 a (step S108). Inaddition, the packet-reception-time executer 203 a outputs an interruptgeneration instruction to the interrupt generator 303 a (step S109). Theinterrupt generator 303 a, which has detected the interrupt generationinstruction generates an interrupt in the processor 301 (step S110). Theprocessor 301 in which the interrupt is generated perform variousprocessings accompanying the data update (step S111).

According to the first embodiment, a fine-out communication chain inwhich data is transmitted from one transmitting-side node computer toone receiving-side node computer is assumed. However, the presentinvention is not limited to the fine-out communication chain.Alternatively, the communication I/F 203 can further include achain-execution determining unit. The chain-execution determining unitcompares a start condition for execution of the chain SWRs stored in thestoring unit 202 with a value of the data storing unit 202 a after thepacket-reception-time executer 203 a has executed the memory operationin the data storing unit 202 a based on an execution notification fromthe packet-reception-time executer 203 a. If determining that theycoincide, the chain-execution determining unit can output an instructionto read the chain SWRs and an instruction to execute correspondingatomic operations to the chain executer 203 b. By so configuring, afine-in communication chain in which the chain processing can be startedby waiting for data synchronization after a plurality of data is inputcan be realized.

The “start condition for execution of chain SWRs” is set as a targetvalue to be finally held in the data storing unit 102 a. However, thepresent invention is not limited thereto. The number of times ofreceiving data necessary for the synchronous processing can be used as“start condition for execution of chain SWRs”. The configuration can besuch that the counted number of times of receiving data is stored in thedata storing unit 102 a, and if the counted number is equal to apredetermined value, the chain SWRs are executed.

In another alternative, the packet-reception-time executer 203 a caninclude a function of turning on a processing flag when a packet relatedto the dependent-data match processing is received, and initializing theflag when the dependent-data match processing is finished. In this case,the packet-reception-time executer 203 a can also include a function ofignoring the other packet that is received before the initialization,and transmitting an instruction to retry transmitting a packet to thetransmitting-side node computer. By so configuring, the dependent datamatch processing can be performed under an exclusive control of notreceiving the other packets.

In yet another alternative, the communication I/F 203 can furtherinclude a chain-indivisibility-instruction-execution-completiondetermining unit. Thechain-indivisibility-instruction-execution-completion determining unitdetermines whether the chain executer 203 b has read all the chain SWRsstored in the chain-SWR storing unit 202 b, executed the correspondingatomic operations, and transmitted the corresponding packets.Furthermore, the communication I/F 203 can include an interruptgenerator that generates an interrupt in the processor 201 of the relaynode computer 200 to start a processing on the received data if thechain-indivisibility-instruction-execution-completion determining unitdetermines that the chain executer 203 b has read all the chain SWRsstored in the chain-SWR storing unit 202 b, executed the correspondingatomic operations, and transmitted the corresponding packets.

In still another alternative, the communication I/F 203 can furtherinclude a completion-notification transmitter that transmits acompletion notification to the processor 201 of the relay node computer200 to start the processing on the received data if thechain-indivisibility-instruction-execution-completion determining unitdetermines that the chain executer 203 b has read all the chain SWRsstored in the chain-SWR storing unit 202 b and executed thecorresponding atomic operations.

In still another alternative, the communication I/F 203 can furtherinclude a communication-processing executer that executes apredetermined communication processing on the transmitting-side nodecomputer if the chain-indivisibility-instruction-execution-completiondetermining unit determines that the chain executer 203 b has read allthe chain SWRs stored in the chain-SWR storing unit 202 b and executedthe corresponding atomic operations.

In still another alternative, the chain executer 203 b can perform amemory operation even in response to the reception of the packet fromthe relay node computer 200 including the communication I/F 203, anddesignate SWRs associated with the received data while referring to thedata storing unit 202 a.

A dependent-data match processing performed among node computers in aparallel computer system according to a second embodiment will beexplained. In the dependent-data match processing according to thesecond embodiment, the higher node computer makes a reference to all thelower node computers about whether dependent data has been updated. FIG.9 is a schematic for explaining features of the dependent-data matchprocessing performed among the node computers in the parallel computersystem according to the second embodiment. In FIG. 9, lower nodecomputers 100 and 100′ serve as lowest node computers, the relay nodecomputer 200 serves as a relay node computer, and the higher nodecomputer 300 serves as the highest node computer. The respective nodecomputers in the parallel computer system shown in FIG. 9 have the datadependency relationship with one another in the multi-tree structure.

In FIG. 9, similarly to FIGS. 1 and 2, data arranged in the higher nodecomputer 300 depends on data arranged in the relay node computer 200adjacent to the higher node computer 300 under the dependencyrelationship in the multi-tree structure. The data arranged in the relaynode computer 200 depends on data arranged in the lower node computer100 adjacent to the relay node computer 200 under the dependencyrelationship in the multi-tree structure. Namely, the data arranged inthe higher node computer 300 depends on the data arranged in the relaynode computer 200 and the lower node computer 100 that are lower thanthe higher node computer 300.

The higher node computer 300 at the highest level makes a reference tothe lower relay node computer 200 adjacent to the higher node computer300 about whether data has been updated as shown in (1) of FIG. 9. Thedata arranged in the relay node computer 200 adjacent to the higher nodecomputer 300 depends on the data arranged in the lower node computer100. The reference about whether the data has been updated in the relaynode computer 200 or the lower node computer 100 is transmitted from thehigher node computer 300 to the lower relay node computer 200 adjacentto the higher node computer 300 and further from the higher nodecomputer 300 to the lower node computer 100 adjacent to the higher nodecomputer 300 at “low cost” using chain communication held by thecommunication I/F included in each of the node computers as shown in (2)of FIG. 9.

Furthermore, if data has been updated in the relay node computer 200 orthe lower node computer 100 (the lower node computer 100 in FIG. 9), anotification of data update is transmitted to the higher node computer300 by the method explained according to the first embodiment.

The meaning of the “low cost” is as follows. According to the secondembodiment, similarly to the first embodiment, the reference aboutwhether the dependent data has been updated is transmitted from thehigher node computer to the lower node computer arranged to bedistributed in the parallel computer system using the chaincommunication held by the communication I/F included in each of the nodecomputers.

If the node computers in the parallel computer system hold communicationusing the chain communication held by the communication I/F included ineach node computer, overhead can be suppressed despite the dependencyrelationship of data in the multi-tree structure/topology. The overheadis generated when the highest node computer transmits the referenceabout whether the dependent data has been updated to the lowest nodecomputer via a plurality of relay node computers.

If the internode communication is used to transmit the reference aboutwhether the dependent data has been updated, then an interrupt occurs ina processor of each node computer whenever a packet is transmitted orreceived and the standby processing for receiving the packet provokes adisturbance in a context switch of the processor. This causesdeceleration of a communication rate at which the node computerscommunicate with one another. According to the second embodiment,similarly to the first embodiment, the internode communication is notused, so that these disadvantages do not occur. It is, therefore,possible to prevent deterioration in performances of the parallelcomputer system and make most use of the performances of the parallelcomputer system without decelerating the communication rate at which thenode computers hold communication with one another. This situation isexpressed as the “low cost”.

According to the second embodiment, the reference about whether thedependent data has been updated is transmitted to all the adjacent lowernode computers. In FIG. 9, a situation in which the reference aboutwhether the dependent data has been updated is transmitted from thehigher node computer 300 to the lower node computers 100 and 100′ viathe relay node computer 200 for brevity of explanation.

A configuration of the lower node computer 100 in the parallel computersystem shown in FIG. 9 will be explained with reference to FIG. 10. Thelower node computer 100, the relay node computer 200, and the highernode computer 300 include identical functional blocks. Functional blocksother than those characteristic of the lower node computer 100 shown inFIG. 10 will not be explained herein. As shown in FIG. 10, the lowernode computer 100 includes the processor 101 that controls entirety ofthe lower node computer 100, the storing unit 102, and the communicationI/F 103 that is a network interface card.

The storing unit 102 includes the data storing unit 102 a such as amemory that is a storage area for storing data, and the chain-SWRstoring unit 102 b that stores therein the chain SWRs. If the chain SWRsare output, all the associated SWRs are output in order. A packet inresponse to each of the output SWRs is transmitted to the outside.

According to the second embodiment, the packet transmitted or receivedincludes not only data on which a corresponding atomic operation isexecuted but also pointer information indicating addresses where thechain SWRs to be executed are stored in the chain-SWR storing unit 102b. The data storing unit 102 a stores therein not only the data on whichthe corresponding atomic operation is performed but also the pointerinformation indicating a top address of the addresses where the chainSWRs to be executed are stored in the chain-SWR storing unit 102 b.

The communication I/F 103 includes a packet-reception-time executer 103c and the chain executer 103 b. Upon reception of a packet related tothe reference about whether data has been updated and transmitted fromthe higher node computer 300 to the lower node computer 100 via therelay node computer 200 as shown in (1) of FIG. 10, thepacket-reception-time executer 103 c executes a memory operationcorresponding to the received packet in the data storing unit 102 a.Furthermore, the packet-reception-time executer 103 c instructs thechain executer 103 b to execute the chain atomic operations.

If the chain executer 103 b is instructed to execute the chain atomicoperations by the packet-reception-time executer 103 c, the chainexecuter 103 b reads the pointer information indicating the top addressof the addresses where the chain SWRs to be executed are stored, fromthe data storing unit 102 a. Furthermore, the chain executer 103 b readsthe first SWR stored at the address indicated by the pointer andexecutes a corresponding atomic operation. Next, the chain executer 103b reads the second SWR from the pointer indicating the address where thesecond SWR to be executed next to the first SWR is stored to accompanythe first SWR stored in the chain-SWR storing unit 102 b, and executes acorresponding atomic operation. The chain processings are repeated aslong as the pointer information indicating an address where an SWR to beexecuted next is stored, is stored. As a consequence, if one packet isreceived from the outside, then the chain SWRs are sequentially read byfunctions of the communication I/F 103, and the corresponding atomicoperations are executed.

Specifically, in response to reception of the packet from the relay nodecomputer 200, the chain SWRs are output. If the SWRs indicate, inparticular, the notification of the data update as shown in (2) of FIG.10, a packet related to the notification of the data update istransmitted to the relay node computer 200.

It is to be noted that the packet-reception-time executer 103 c canreceive not only the packets from the other node computer, but alsothose from the lower node computer 100 including thepacket-reception-time executer 103 c. This is based on the fact that thepacket-reception-time executer 103 c can transmit packets to the lowernode computer 100.

Furthermore, the address of the memory area for which the operation isdesignated by the received packet is a virtual address. Thecommunication I/F 103, therefore, includes a function of converting thevirtual address into an actual address. The packet-reception-timeexecuter 103 c outputs an instruction to cause the chain executer 103 bto execute the chain processings related to the data reception, to thechain executer 103 b. The chain executer 103 b transmits a correspondingpacket to the other node computer in response to the instruction totransmit the packet to the other node computer.

A configuration of the relay node computer 200 in the parallel computersystem shown in FIG. 9 will be explained with reference to FIG. 11.Functional blocks other than those characteristic of the relay nodecomputer 200 shown in FIG. 11 will not be explained herein.

The relay node computer 200 includes the processor 201 such as a CPU,the storing unit 202, and the communication I/F 203 that is a networkinterface card. The storing unit 202 includes achain-processing-execution-condition storing unit 202 c, the datastoring unit 202 a such as a memory that is a storage area for storingdata, and the chain-SWR storing unit 202 b that stores therein the chainSWRs. The chain-processing-execution-condition storing unit 202 c storestherein a condition for executing the chain processings.

The communication I/F 203 includes the packet-reception-time executer203 a, the chain executer 203 b, and achain-processing-execution-condition determining unit 203 c. Uponreception of a packet related to the reference about whether data hasbeen updated from the higher node computer 300, thepacket-reception-time executer 203 a executes a memory operationcorresponding to the received packet in the data storing unit 202 a.Furthermore, the packet-reception-time executer 203 a instructs thechain executer 203 b to execute the chain atomic operations.

First of all, the chain executer 203 b reads the pointer informationindicating the top address of the addresses where the chain SWRs to beexecuted are stored, from the data storing unit 202 a, reads the firstSWR stored at the address indicated by the pointer, and executes acorresponding atomic operation based on a chain-processing-executioninstruction from the chain-processing-execution-condition determiningunit 203 c. Next, the chain executer 203 b reads the second SWR from thepointer indicating the address where the second SWR to be executed nextto the first SWR is stored to accompany the first SWR in the chain-SWRstoring unit 202 b, and executes a corresponding atomic operation. Thechain processings are repeated as long as the pointer informationindicating an address where an SWR to be executed next is stored, isstored. As a consequence, if one packet is received from the outside,then the chain SWRs is sequentially read by functions of thecommunication I/F 203, the corresponding atomic operations are executed,and corresponding packets are transmitted. Specifically, the relay nodecomputer 200 transmits chain packets to the lower node computers 100 and100′ (see “a packet related to the reference about whether data has beenupdated and transmitted to the lower node computer 100 as shown in (2)of FIG. 11” and “a packet related to the reference about whether datahas been updated and transmitted to the lower node computer 100′ asshown in (2′) of FIG. 11”).

The chain-processing-execution-condition determining unit 203 c reads avalue of the data storing unit 202 a after the packet-reception-timeexecuter 203 a has executed the memory operation in the data storingunit 202 a. The chain-processing-execution-condition determining unit203 c compares a chain-processing-execution condition from thechain-processing-execution-condition storing unit 202 c with the memoryvalue based on a notification from the packet-reception-time executer203 a that the atomic operation has been executed. If determining thatthey coincide, the chain-processing-execution-condition determining unit203 c outputs an instruction to execute the chain processings to thechain executer 203 b, and an instruction to transmit a completionnotification to all the node computers that have transmitted packetsbased on the memory operation to the chain executer 203 b.

Specifically, the chain-processing-execution-condition determining unit203 c performs a processing for waiting for synchronization of a packet(packet 1) from the lower node computer 100 as shown in (3) of FIG. 11with a packet (packet 2) from the lower node computer 100′ as shown in(3′) of FIG. 11.

Moreover, if the chain-processing-execution-condition determining unit203 c completes the processing for waiting for synchronization, thechain executer 203 b transmits a packet according to an SWR output to belinked to completion of the waiting for synchronization of the packets 1and 2 to the higher node computer 300.

According to the second embodiment, the “chain-processing-executioncondition” is set as a target value to be finally held in the datastoring unit 202 a. Furthermore, “the value of the data storing unit 202a after the memory operation” is set as the value stored in the datastoring unit 202 a itself. However, the present invention is not limitedthereto. The number of times of receiving data necessary to startexecution of the chain processings can be used as the“chain-processing-execution condition”, and the counted number of timesof receiving data can be used as the “value of the data storing unit 202a after the memory operation”.

Moreover, the chain-processing-execution-condition storing unit 202 c isnot necessarily arranged in the storing unit 202 but can be arranged ina predetermined storage area in the communication I/F 203.

The notification indicating execution of the atomic operation from thepacket-reception-time executer 203 a is a kind of the atomic operation.Likewise, the notification indicating execution of the comparison of thechain-processing-execution condition with the value of the data storingunit 202 a after the memory operation is also a kind of the atomicoperation. Furthermore, the instruction to execute the chain processingsto be output to the chain executer 203 b if it is determined that thechain-processing-execution condition coincides with the value of thedata storing unit 202 a after the memory operation is a kind of theatomic operation. These atomic operations are those newly added to thecommunication I/F 203 according to the second embodiment.

Upon reception of a packet related to the reference about whether datahas been updated from the other node computer, the packet-reception-timeexecuter 203 a executes an atomic operation corresponding to the packetand directly performs a memory operation in the data storing unit 202 a.If the relay node computer 200 receives a packet related to oneprocessing for the reference about whether data has been updated fromthe other node computer for the first time, the packet-reception-timeexecuter 203 a manages information indicating that a processing for thereference about whether data has been updated using a flag or the likeindicating that the processing for the reference about whether data hasbeen updated is being performed. If the notification indicatingexecution of the atomic operation is output, the packet-reception-timeexecuter 203 a initializes the flag or the like to make the end of theprocessing for the reference about whether data has been updatedrecognizable. In this case, the packet-reception-time executer 203 a canalso include a function of ignoring the other packet that is receivedbefore the initialization, and transmitting an instruction to retrytransmitting a packet to the transmitting-side node computer. By soconfiguring, an exclusive control of not receiving the other packetsduring the reference about whether data has been updated can beperformed. In this manner, the packet-reception-time executer 203 a canperform the exclusive control of not performing the other processingwhile one processing for the reference about whether data has beenupdated is being performed.

It is to be noted that the packet-reception-time executer 203 a canreceive not only packets from the other node computer, but also thosefrom the relay node computer 200 including the packet-reception-timeexecuter 203 a. This is based on the fact that the packet-reception-timeexecuter 203 a can transmit packets to the relay node computer 200.

Furthermore, the address of the memory area for which the operation isdesignated by the received packet is a virtual address. Thecommunication I/F 203, therefore, includes a function of converting thevirtual address into an actual address. The packet-reception-timeexecuter 203 a outputs an instruction to cause the chain executer 203 bto execute the chain processings related to the data reception, to thechain executer 203 b. The chain executer 203 b transmits a correspondingpacket to the other node computer in response to the instruction totransmit the packet to the other node computer.

A configuration of the higher node computer 300 in the parallel computersystem shown in FIG. 9 will be explained with reference to FIG. 12.Functional blocks other than those characteristic of the higher nodecomputer 300 shown in FIG. 12 will not be explained herein.

As shown in FIG. 12, the higher node computer 300 includes the processor301 such as a CPU, the storing unit 302, and the communication I/F 303that is a network interface card. The storing unit 302 includes thedata-update-flag storing unit 302 a that stores therein the notificationindicating the update of data in the lower node computer 100 or therelay node computer 200 using a data-update flag, and the data storingunit 302 b that is an area in which data including a received packet iswritten. The communication I/F 303 includes the interrupt generator 303a and an atomic operation executer 303 c.

The interrupt generator 303 a generates an interrupt or an event in theprocessor 301 based on an interrupt-processing generation instructionfrom the atomic operation executer 303 c. The atomic operation executer303 c transmits a packet related to the reference about whether data hasbeen updated to the relay node computer 200 as shown in (1) of FIG. 12.Furthermore, the atomic operation executer 303 c receives a packetrelated to the data update notification from the relay node computer 200as shown in (2) of FIG. 12. The atomic operation executer 303 c executesan atomic operation corresponding to the received packet and turns onthe data-update flag stored in the data-update-flag storing unit 302 a.

It is to be noted that the atomic operation executer 303 c can receivenot only packets from the other node computer, but also those from thehigher node computer 300 including the atomic operation executer 303 c.This is based on the fact that the atomic operation executer 303 c cantransmit packets to the higher node computer 300.

Furthermore, the address of the memory area for which the operation isdesignated by the received packet is a virtual address. Thecommunication I/F 303, therefore, includes a function of converting thevirtual address into an actual address. The packet-reception-timeexecuter 303 b outputs an instruction to cause the interrupt generator303 a to generate an interrupt processing related to the data reception,to the interrupt generator 303 a.

In this manner, in the lower node computers 100 and 100′, the relay nodecomputer 200, and the higher node computer 300 according to the secondembodiment, a transmission processing for transmitting the referenceabout whether dependent data has been updated in the lower node computer100 from the higher node computer 300 to the lower computers 100 and100′ via the relay node computer 200 is performed only using thecommunication I/Fs 103, 203, and 303. Conventionally, the transmissionprocessing is performed by the processors 101, 201, and 301. Accordingto the second embodiment, it is possible to suppress a disturbance inthe context switch of each processor caused by the interrupt generatedwhenever a packet is received and by a synchronous processing. Namely,according to the second embodiment, the generation of the interruptwhenever a packet related to the processing for the reference aboutwhether data has been updated is received can be suppressed.Furthermore, the transmission processing is handed over from softwarecontrol performed by each processor to a hardware processing performedby each communication I/F. It is, therefore, possible to suppress thedisturbance in the context switch of each processor, increase thecommunication rate at which the node computers communicate with oneanother in the parallel computer system, and improve processingcapabilities of the parallel computer system.

The dependent-data match processing performed among the node computersin the parallel computer system shown in FIG. 9 will be explained withreference to FIGS. 13 and 14. As shown in FIGS. 13 and 14, in the highernode computer 300, the atomic operation executer 303 c transmits thepacket related to the reference about whether data has been updated tothe relay node computer 200 (step S111). In the relay node computer 200,when the packet-reception-time executer 203 a receives the packetrelated to the reference about whether data has been updated from thehigher node computer 300, the packet-reception-time executer 203 anotifies the chain executer 203 b of the reference about whether datahas been updated (step S112). In response to the notification, the chainexecuter 203 b reads chain SWRs related to the reference about whetherdata has been updated from the storing unit 202 (step S113), andtransmits corresponding chain packets related to the reference aboutwhether data has been updated to the lower node computer 100 (stepS114).

In the lower node computer 100, upon reception of the correspondingchain packets related to the reference about whether data has beenupdated, the packet-reception-time executer 103 c notifies the chainexecuter 103 b of the notification indicating the reference aboutwhether data has been updated (step S115). The chain executer 103 breads chain SWRs related to the notification indicating the referenceabout whether data has been updated from the storing unit 102 (stepS116), and determines whether the dependent data stored in the storingunit 102 has been updated (step S117). It is to be noted that the lowernode computer 100′ similarly performs the processing at the steps S114to S117. If it is determined at the step S117 that the data stored inthe storing unit 102 has been updated, the notification indicatingupdate of the dependent data explained according to the first embodimentis transmitted from the lower node computer 100 to the higher nodecomputer 300 via the relay node computer 200.

According to the first and the second embodiments, the number of nodecomputers connected to one another in the parallel computer system islimited to a specific number for brevity of explanation. However, aslong as the node computers can be connected in the tree structure, thenumber of node computers can exceed that explained in the first andsecond embodiments.

Moreover, the communication I/Fs 103, 203, and 303 according to thefirst and the second embodiments are compatible with conventionalcommunication I/Fs to serve as communication mechanisms. Therefore, thenode computer that includes the communication I/F 103, 203 or 303 can beconnected to a node computer that does not include the communication I/F103, 203 or 303. The node computer that does not include thecommunication I/F 103, 203 or 303 has disadvantages of deterioration incommunication performances. For example, an interrupt in a processorrelated to the internode communication and a disturbance in a contextswitch of the processor occur to the node computer that does not includethe communication I/F 103, 203 or 303. The node computer that does notinclude the communication I/F 103, 203 or 303 has no otherdisadvantages. Namely, a mixture of the node computers that include thecommunication I/F 103, 203 or 303 and the node computers that do notinclude the communication I/F 103, 203 or 303 can be arranged toconstitute a parallel computer system.

As described above, according to an embodiment of the present invention,it is advantageously possible to suppress the overhead generated whenthe node computers in the parallel computer system communicate with oneanother, and prevent deterioration in the performances of the parallelcomputer system.

Although the invention has been described with respect to a specificembodiment for a complete and clear disclosure, the appended claims arenot to be thus limited but are to be construed as embodying allmodifications and alternative constructions that may occur to oneskilled in the art that fairly fall within the basic teaching herein setforth.

1. A communication interface device of a node computer in a parallelcomputer system, the communication interface device comprising: a firststoring unit that stores therein a plurality of indivisibilityinstructions, each indivisibility instruction of the indivisibilityinstructions being associated with one another in order and beingchained using an address that indicates a next chained indivisibilityinstruction; a detecting unit that detects a change of first data byreceiving a notification of the change of the first data from a lowernode computer, the first data being stored in the lower node computer,second data that is dependent on the first data being stored in the nodecomputer, the change of first data being made by the lower nodecomputer; a first designating unit that stores location information ofan indivisibility instruction associated with the first data among theindivisibility instructions, and designates, when the detecting unitdetects the change in the first data, the indivisibility instruction bythe location information; a first executing unit that transmits acommunication packet from the node computer to a higher node computer byexecuting the indivisibility instruction designated by the firstdesignating unit, and transmits another communication packet than thecommunication packet from the node computer to a higher node computer byexecuting the next chained indivisibility instruction based on theaddress that indicates a next chained indivisibility instruction, thecommunication packet indicating the change of the first data; and asecond storing unit that stores therein information on invalidation ofthe second data that is dependent on the first data, based on thenotification of the change of the first data received from the lowernode computer.
 2. The communication interface device according to claim1, further comprising: a generating unit that generates, when it isdetermined that the first executing unit has executed all chainedindivisibility instructions stored in the first storing unit, aninterrupt in a processor of the node computer for starting a processingafter reception of the notification of the change.
 3. The communicationinterface device according to claim 1, further comprising: an outputunit that outputs, when it is determined that the first executing unithas executed all chained indivisibility instructions stored in the firststoring unit, a completion notification to a processor of the nodecomputer for starting a processing after reception of the notificationof the change.
 4. The communication interface device according to claim1, further comprising: a second executing unit that executes, when it isdetermined that the first executing unit has executed all chainedindivisibility instructions stored in the first storing unit, acommunication processing defined in advance for the lower node computer.5. The communication interface device according to claim 1, furthercomprising: an inquiring unit that inquires whether there is a change offirst data that is distributed to the lower node computer on which thesecond data that belongs to the higher node computer is dependent. 6.The communication interface device according to claim 5, furthercomprising: a second designating unit that designates an indivisibilityinstruction corresponding to an inquiry from the higher node computerabout the change of the first data, by referring to the first storingunit; and a second executing unit that executes the indivisibilityinstruction designated by the second designating unit, and furtherexecutes the chained indivisibility instruction corresponding to theindivisibility instruction designated by the second designating unit. 7.The communication interface device according to claim 5, furthercomprising: a notifying unit that notifies the change of the first datain response to the inquiry from the higher node computer to the highernode computer.
 8. The communication interface device according to claim1, further comprising: a third storing unit that stores data receptioninformation indicating that data has been received from a lower nodecomputer; and an initializing unit that initializes, when it isdetermined that the first executing unit has executed all chainedindivisibility instructions stored in the first storing unit, the datareception information stored in the third storing unit.
 9. Thecommunication interface device according to claim 8, further comprising:a stopping unit that stops, when data is further received from the lowernode computer before the initializing unit initializes the datareception information, the first designating unit from performing amemory operation and designating the indivisibility instruction; and atransmitting unit that transmits information indicating that thestopping unit has stopped the first designating unit from performing thememory operation and designating the indivisibility instruction.
 10. Thecommunication interface device according to claim 9, further comprising:a retrying unit that retries, when the information that indicates thatthe stopping unit has stopped the first designating unit from performingthe memory operation and designating the indivisibility instruction isreceived from a receiving-side node computer, a transmission of the datato a receiving-side node computer.
 11. The communication interfacedevice according to claim 1, further comprising: a generating unit thatgenerates, when the second storing unit stores the information on theinvalidation of the second data based on the notification of the changeof the first data, an interrupt in a processor of the node computer forstarting a processing after the reception of the notification of thechange.
 12. A communication method for a communication interface deviceof a node computer in a parallel computer system, the communicationmethod comprising: first storing a plurality of indivisibilityinstructions, each indivisibility instruction of the indivisibilityinstructions being associated with one another in order and beingchained using an address that indicates a next chained indivisibilityinstruction; detecting a change of first data by receiving anotification of the change of the first data from a lower node computer,the first data being stored in the lower node computer, second data thatis dependent on the first data being stored in the node computer, thechange of first data being made by the lower node computer; secondstoring location information of an indivisibility instruction associatedwith the first data among the indivisibility instructions; firstdesignating, when the change in the first data is detected, theindivisibility instruction by the location information; transmitting acommunication packet from the node computer to a higher node computer byexecuting the indivisibility instruction designated at the firstdesignating, and transmitting another communication packet than thecommunication packet from the node computer to a higher node computer byexecuting the next chained indivisibility instruction based on theaddress that indicates a next chained indivisibility instruction, thecommunication packet indicating the change of the first data; and thirdstoring information on invalidation of the second data that is dependenton the first data, based on the notification of the change of the firstdata received from the lower node computer.
 13. The communication methodaccording to claim 12, further comprising: generating, when it isdetermined that all chained indivisibility instructions stored at thefirst storing is executed at the transmitting, an interrupt in aprocessor of the node computer for starting a processing after receptionof the notification of the change.
 14. The communication methodaccording to claim 12, further comprising: outputting, when it isdetermined that all chained indivisibility instructions stored at thefirst storing is executed at the transmitting, a completion notificationto a processor of the node computer for starting a processing afterreception of the notification of the change.
 15. The communicationmethod according to claim 12, further comprising: executing, when it isdetermined that all chained indivisibility instructions stored at thefirst storing is executed at the transmitting, a communicationprocessing defined in advance for the lower node computer.
 16. Thecommunication method according to claim 12, further comprising:inquiring whether there is a change of first data that is distributed tothe lower node computer on which the second data that belongs to thehigher node computer is dependent.
 17. The communication methodaccording to claim 16, further comprising: second designating includingdesignating an indivisibility instruction corresponding to an inquiryfrom the higher node computer about the change of the first data, byreferring to the stored chained indivisibility instruction; andtransmitting including executing the indivisibility instructiondesignated at the second designating, and further executes the chainedindivisibility instruction corresponding to the indivisibilityinstruction designated by the second designating.
 18. The communicationmethod according to claim 16, further comprising: notifying the changeof the first data in response to the inquiry from the higher nodecomputer to the higher node computer.
 19. The communication methodaccording to claim 12, further comprising: fourth storing data receptioninformation indicating that data has been received from a lower nodecomputer; and initializing, when it is determined that all chainedindivisibility instructions stored at the first storing is executed atthe transmitting, the data reception information stored at the fourthstoring.
 20. The communication method according to claim 19, furthercomprising: stopping, when data is further received from the lower nodecomputer before the data reception information is initialized at theinitializing, the first designating from performing a memory operationand designating the indivisibility instruction; and transmittinginformation indicating that the first designating is stopped.
 21. Thecommunication method according to claim 20, further comprising:retrying, when the information that indicates that the first designatingis stopped is received from a receiving-side node computer, atransmission of the data to a receiving-side node computer.
 22. Thecommunication method according to claim 12, further comprising:generating, when the information on the invalidation of the second datais stored at the third storing based on the notification of the changeof the first data, an interrupt in a processor of the node computer forstarting a processing after the reception of the notification of thechange.